package jjn.carl.dp;

import java.util.Arrays;
import java.util.Scanner;

/**
 * @author Jjn
 * @since 2023/8/25 21:27
 */
public class LeetCode674 {
    public int findLengthOfLCIS(int[] nums) {
        if (nums.length == 0) {
            return 0;
        }
        int[] dp = new int[nums.length];
        int result = 1;
        Arrays.fill(dp, 1);
        for (int i = 1; i < nums.length; i++) {
            if (nums[i] > nums[i - 1]) {
                dp[i] = dp[i - 1] + 1;
            }
            result = Math.max(dp[i], result);
        }
        return result;
    }
    
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int total = scanner.nextInt();
        int[] nums = new int[total];
        for (int i = 0; i < total; i++) {
            nums[i] = scanner.nextInt();
        }
        int length = new LeetCode674().findLengthOfLCIS(nums);
        System.out.println(length);
    }
}
